Multi-Adjoint Logic Programming
نویسنده
چکیده
A synthesis of results of the recently introduced paradigm of multi-adjoint logic programming is presented. These results range from a proof theory together with some (quasi)completeness results to general termination results, and from the neural-like implementation of its fix-point semantics to the more general biresiduated multi-adjoint logic programming and its relationship with other approaches.
منابع مشابه
Revisiting Reductants in the Multi-adjoint Logic Programming Framework
Reductants are a special kind of fuzzy rules which constitute an essential theoretical tool for proving correctness properties. A multi-adjoint logic program, when interpreted on an arbitrary lattice, has to include all its reductants in order to preserve the approximate completeness property. In this work, after revisiting the different notions of reductant arisen in the framework of multi-adj...
متن کاملDedekind-MacNeille Completion and Multi-adjoint Lattices
Among other applications, multi-adjoint lattices have been successfully used for modeling flexible notions of truth-degrees in the fuzzy extension of logic programming called MALP (Multi-Adjoint Logic Programming). In this paper we focus in the completion of such mathematical construct by adapting the classical notion of Dedekind-MacNeille in order to relax this usual hypothesis on such kind of...
متن کاملBiresiduated Multi-Adjoint Logic Programming
Multi-adjoint logic programs were recently proposed as a generalisation of monotonic and residuated logic programs introduced, in that simultaneous use of several implications in the rules and rather general connectives in the bodies are allowed. In this work, the possible existence of biresiduated pairs is considered, later, on the resulting framework of biresiduated multi-adjoint logic progra...
متن کاملA Neural Approach to Abductive Multi-adjoint Reasoning
A neural approach to propositional multi-adjoint logic programming was recently introduced. In this paper we extend the neural approach to multi-adjoint deduction and, furthermore, modify it to cope with abductive multi-adjoint reasoning, where adaptations of the uncertainty factor in a knowledge base are carried out automatically so that a number of given observations can be adequately explained.
متن کاملMulti-adjoint Logic Programming with Continuous Semantics
Considering different implication operators, such as Lukasiewicz, Gödel or product implication in the same logic program, naturally leads to the allowance of several adjoint pairs in the lattice of truthvalues. In this paper we apply this idea to introduce multi-adjoint logic programs as an extension of monotonic logic programs. The continuity of the immediate consequences operators is proved a...
متن کامل